Polar decomposition of oblique projections
نویسندگان
چکیده
منابع مشابه
Geometry of Oblique Projections
Let A be a unital C-algebra. Denote by P the space of selfadjoint projections of A. We study the relationship between P and the spaces of projections P a determined by the diierent involutions # a induced by positive invertible elements a 2 A. The maps ' p : P ! P a sending p to the unique q 2 P a with the same range as p and a : P a ! P sending q to the unitary part of the polar decomposition ...
متن کاملOblique Projections and Abstract Splines
Given a closed subspace S of a Hilbert space H and a bounded linear operator A ∈ L(H) which is positive, consider the set of all A-selfadjoint projections onto S P(A,S) = {Q ∈ L(H) : Q2 = Q , Q(H) = S , AQ = Q∗A}. In addition, if H1 is another Hilbert space, T : H → H1 is a bounded linear operator such that T ∗T = A and ξ ∈ H, consider the set of (T,S) spline interpolants to ξ: sp (T,S, ξ) = {η...
متن کاملOblique projections and Schur complements
LetH be a Hilbert space, L(H) the algebra of all bounded linear operators onH and 〈, 〉A : H ×H → C the bounded sesquilinear form induced by a selfadjoint A ∈ L(H), 〈ξ, η〉A = 〈Aξ, η〉 , ξ, η ∈ H. Given T ∈ L(H), T is A-selfadjoint if AT = T A. If S ⊆ H is a closed subspace, we study the set of A-selfadjoint projections onto S, P(A,S) = {Q ∈ L(H) : Q = Q , R(Q) = S , AQ = QA} for different choices...
متن کاملDecomposition of Near-Infrared Spectroscopy Signals Using Oblique Subspace Projections: Applications in Brain Hemodynamic Monitoring
Clinical data is comprised by a large number of synchronously collected biomedical signals that are measured at different locations. Deciphering the interrelationships of these signals can yield important information about their dependence providing some useful clinical diagnostic data. For instance, by computing the coupling between Near-Infrared Spectroscopy signals (NIRS) and systemic variab...
متن کاملCompressive Reinforcement Learning with Oblique Random Projections
Compressive sensing has been rapidly growing as a non-adaptive dimensionality reduction framework, wherein high-dimensional data is projected onto a randomly generated subspace. In this paper we explore a paradigm called compressive reinforcement learning, where approximately optimal policies are computed in a lowdimensional subspace generated from a high-dimensional feature space through rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.03.016